Analysis of Joins and Semi Joins in a Distributed Database Query
نویسندگان
چکیده
Database is defined as collection of files or table, where as DBMS stands for Database Management System which is collection of unified programs used to manage overall activities of the database. The two dominant approaches used for storing and managing database are centralized database management system and distributed database management system in which data is placed at central location and distributed over several locations respectively. Independent of the database approach used, one of the foremost issue in the database is the retrieval of data by using multiple table from central repository in centralized database and from number of sites in distributed database. Joins and semi joins are primitive operations used to extract required information from one, two or multiple tables. In this paper the focus is given on computing and analyzing the performance of joins and semi joins in distributed database system. The various metrics that will be considered while analyzing performance of join and semi join in distributed database system are Query Cost, Memory used, CPU Cost, Input Output Cost, Sort Operations, Data Transmission, Total Time and Response Time. In short the intention of this study is analyze the performance and behavior of join and semi-join approach in distributed database system.
منابع مشابه
انتخاب مناسبترین زبان پرسوجو برای استفاده از فراپیوندها جهت استخراج دادهها در حالت دیتالوگ در سامانه پایگاه داده استنتاجی DES
Deductive Database systems are designed based on a logical data model. Data (as opposed to Relational Databases Management System (RDBMS) in which data stored in tables) are saved as facts in a Deductive Database system. Datalog Educational System (DES) is a Deductive Database system that Datalog mode is the default mode in this system. It can extract data to use outer joins with three query la...
متن کاملQuery Acceleration in Distributed Database Systems
The advent of telecommunication era and the constant development of hardware and network structures have encouraged the decentralization of data while increasing the needs to access information from different sites. Query optimization strategies aim to minimize the cost of transferring data across networks. Many techniques and algorithms have been proposed to optimize queries. Perhaps one of th...
متن کاملAn Optimization Technique for Spatial Compound Joins Based on a Topological Relationship Query and Buffering Analysis in DSDBs with Partitioning Fragmentation
Spatial Partitioning Fragmentation (SPF) is a popular method to partition data in Distributed Spatial Databases (DSDBs). The issue of cross-border queries is an inherent problem however with distributed spatial data queries based on partitioning fragmentation given a continuity and strong correlation of geospatial data. In the case of partitioning fragmentation, a global spatial join can be tra...
متن کاملOptimizing Distributed Joins with Bloom Filters
Distributed joins have gained importance in the past decade, mainly due to the increased number of available data sources on the Internet. In this work we extend Bloomjoin, the state of the art algorithm for distributed joins, so that it minimizes the network usage for the query execution based on database statistics. We present 4 extensions of the algorithm, and construct a query optimizer for...
متن کاملProcessing Inequality Queries
Bernstein and Goodman showed that natural inequality ( NI) queries can be processed efficiently by semijoins, if there are no multiple inequality join edges, nor cycles with one or zero doublet. In this paper procedures to hand1 e these cases efficiently are given. Multiple inequality join edges can be processed by multi-attribute inequality semijoins. Two procedures based on generalized semi-j...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012